Lazy Incremental Learning of Control Knowledge for E ciently Obtaining Quality Plans

نویسندگان

  • Daniel Borrajo
  • Manuela Veloso
چکیده

General-purpose generative planners use domain-independent search heuristics to generate solutions for problems in a variety of domains. However, in some situations these heuristics force the planner to perform ineeciently or obtain solutions of poor quality. Learning from experience can help to identify the particular situations for which the domain-independent heuristics need to be overridden. Most of the past learning approaches are fully deductive and eagerly acquire correct control knowledge from a necessarily complete domain theory and a few examples to focus their scope. These learning strategies are hard to generalize in the case of nonlinear planning, where it is diicult to capture correct explanations of the interactions among goals, multiple planning operator choices, and situational data. In this article, we present a lazy learning method that combines a deductive and an inductive strategy to eeciently learn control knowledge incrementally with experience. We present hamlet, a system we developed that learns control knowledge to improve both search eeciency and the quality of the solutions generated by a nonlinear planner, namely prodigy4.0. We have identiied three lazy aspects of our approach from which we believe hamlet greatly beneets: lazy explanation of successes, incremental reenement of acquired knowledge, and lazy learning to override only the default behavior of the problem solver. We show empirical results that support the eeectiveness of this overall lazy learning approach, in terms of improving the eeciency of the problem solver and the quality of the solutions produced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lazy Incremental Learning of Control Knowledge for Eeciently Obtaining Quality Plans

General-purpose generative planners use domain-independent search heuristics to generate solutions for problems in a variety of domains. However, in some situations these heuristics force the planner to perform ineeciently or obtain solutions of poor quality. Learning from experience can help to identify the particular situations for which the domain-independent heuristics need to be overridden...

متن کامل

ciently Executing Information - Gathering Plans

We describe Razor, a planning-based information-gathering agent that assists users by automatically determining which Internet information sites are relevant to their query, accessing those sites in parallel, and integrating the results. Razor uses a disjunctive graphbased plan representation. It then uses a novel and powerful form of local completeness reasoning in order to transform those pla...

متن کامل

A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System

In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...

متن کامل

The Role of Student Characteristics, Content Quality and Knowledge Management in Using E-Learning by Medical Students through Mediation of E-Learning Acceptance (Case Study: Shiraz University of Medical Sciences)

Introduction: Considering the importance of using e- learning in the medical education system, this study aims to investigate the role of students' characteristics, content quality and knowledge management in using  e- learning system through the mediation of e-learning acceptance among students of Shiraz University of Medical Sciences. Methods: In terms of purpose and nature, this research is ...

متن کامل

A New Method for Consequence Finding and Compilation in Restricted Languages

SFK (skip-filtered, kernel) resolution is a new method for finding "interesting" consequences of a first order clausal theory E, namely those in some restricted target language £T. In its more restrictive form, SFK resolution corresponds to a relatively efficient SAT method, directional resolution; in its more general form, to a full prime implicate algorithm, namely Tison’s. It generalizes bot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996